A Parallel Algorithm for Solving Tridiagonal Linear Systems on Distributed-Memory Multiprocessors
نویسندگان
چکیده
The coarse-grainded architecture model has been proposed to be a model of iently close existing parallel machines. Under this model we design a ommunication-efficient parallel algorithm for the solution of tridiagonal linear systems with n eq indicating the efficiency and scalability of proposed algorithm.
منابع مشابه
A parallel solver for tridiagonal linear systems for distributed memory parallel computers
Brugnano, L_, A parallel solver for tridiagonal linear systems for distributed memory parallel computers, Parallel Computing 17 (1991) 1017-1023. The solution of linear tridiagonal systems is a very common problem in Numerical Analysis. Many algorithms are known for solving such linear systems on vector and parallel computers [3,4,6-9]. In this paper a new parallel method is presented, which is...
متن کاملParallel Strategy for Solving Block-Tridiagonal Linear Systems
Efficient parallel iterative algorithm is investigated for solving block-tridiagonal linear systems on distributed-memory multi-computers. Based on Galerkin theory, the communication only need twice between the adjacent processors per iteration step. Furthermore, the condition for convergence was given when the coefficient matrix A is a symmetric positive definite matrix. Numerical experiments ...
متن کاملParallel Solution of Sparse Linear Least Squares Problems on Distributed-Memory Multiprocessors
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملStatic versus dynamic heterogeneous parallel schemes to solve the symmetric tridiagonal eigenvalue problem
Computation of the eigenvalues of a symmetric tridiagonal matrix is a problem of great relevance. Many linear algebra libraries provide subroutines for solving it. But none of them is oriented to be executed in heterogeneous distributed memory multicomputers. In this work we focus on this kind of platforms. Two different load balancing schemes are presented and implemented. The experimental res...
متن کاملParallel Solution of Sparse Linear Least Squares Problemson Distributed - Memory
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal of High Speed Computing
دوره 6 شماره
صفحات -
تاریخ انتشار 1994